Complements And Adjuncts In Dependency Grammar Parsing Emulated By A Constrained Context-Free Grammar

نویسندگان

  • Tom Bong-Yeung Lai
  • Changning Huang
چکیده

Generalizing from efforts parsing natural language sentences using the grammar formalism, Dependency Grammar (DG) has been emulated by a context-free grammar (CFG) constrained by grammatical function annotation. Single-headedness and projectivity are assumed. This approach has the benefit of making general constraint-based context-free grammar parsing facilities available to DG analysis. This paper describes an experimental implementation of this approach using unification to realize grammatical function constraints imposed on a dependency structure backbone emulated by a context-flee grammar. Treating complements of a head word using subcategoHzation lists residing in the head word makes it possible to keep phrase-structure-rule-like mechanisms to the minimum. Adjuncts are treated with a syntactic mechanism that does not reside in the lexicon in this generally lexical approach to grammar. I n t r o d u c t i o n The mathematical properties of Dependency Grammar (Tesniere (1959)) are studied by Gaifman (1965) and Hays (1964). Following their footsteps, Robinson (1970) formulates four axioms to govern the weU-formedness of dependency structures: (a) One and only one element is independent; (b) All others depend directly on some element; (c) No element depends directly on more than one other;, (d) If A depends directly on B and some element C intervenes between them (in linear order ofs~ing), then C depends directly on A or on B or some other intervening element. These axioms require that all words should depend on only one word and that, arranging words in linear order, crossing of dependency links as in Fig.l should not be allowed. Yuyanxue linguistics wo zhidao ta xihuan I know he likes

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Free Word Order in a Constraint-based Implementation of Dependency Grammar

Parsing of sentences based on Dependency Grammar is emulated with a constraintand unification-based mechanism that preserves single-headedness and projectivity in syntactic dependency. Working on Chinese, and referring to English at times, the authors have treated subcategorization properties of verbs on the assumptions that relative positions of obligatory complements of a verb are fixed, and ...

متن کامل

Resolving Ambiguity in Inter-chunk Dependency Parsing

Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency grammar. We use a chunking procedure to avoid constructing a mistaken dependency structure. Chunking reduces the scope of dependency relations between dependents and governors. This paper presents a method to resolve amb...

متن کامل

A Simple String-Rewriting Formalism For Dependency Grammar

Recently, dependency grammar has gained renewed attention as empirical methods in parsing have emphasized the importance of relations between words, which is what dependency grammars model explicitly, but context-free phrase-structure grammars do not. While there has been much work on formalizing dependency grammar and on parsing algorithms for dependency grammars in the past, there is not a co...

متن کامل

Unlexicalised Hidden Variable Models of Split Dependency Grammars

This paper investigates transforms of split dependency grammars into unlexicalised context-free grammars annotated with hidden symbols. Our best unlexicalised grammar achieves an accuracy of 88% on the Penn Treebank data set, that represents a 50% reduction in error over previously published results on unlexicalised dependency parsing.

متن کامل

Transition-based dependency parsing as latent-variable constituent parsing

We provide a theoretical argument that a common form of projective transitionbased dependency parsing is less powerful than constituent parsing using latent variables. The argument is a proof that, under reasonable assumptions, a transition-based dependency parser can be converted to a latent-variable context-free grammar producing equivalent structures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998